Separating NP-Completeness Notions under Strong Hypotheses
نویسندگان
چکیده
منابع مشابه
Bi-Immunity Separates Strong NP-Completeness Notions
We prove that if for some ǫ > 0, NP contains a set that is DTIME(2n ǫ )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-truth-table complete for NP. Thus this hypothesis implies a strong separation of completeness notions for NP. Lutz and Mayordomo [LM96] and Ambos-Spies and Bentzien [ASB00] previously obtained the same consequence usi...
متن کاملSeparation of NP-Completeness Notions
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is T-complete but not P tt -complete. We provide fairly thorough analyses of the hypotheses that we introduce.
متن کاملCook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract)
Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential time), it is show n that there is a language that is P T -complete (\Cook complete"), but not P m -complete (\Karp-Levin complete"), for NP. This conclusion, widely believed to be true, is not known to follow from P 6= NP or other traditional complexity-theoretic hypoth...
متن کاملOn Strong NP-Completeness of Rational Problems
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were assumed to be integers. We re-examine here the computational complexity of all these problems in the setting where the weights and profits are allowed to be...
متن کاملStrong NP-Completeness of a Matrix Similarity Problem
Consider the following problem: given an upper triangular matrix A, with rational entries and distinct diagonal elements, and a tolerance 1, decide whether there exists a nonsingu-lar matrix G, with condition number bounded by , such that G ?1 AG is 22 block diagonal. This problem, which we shall refer to as DICHOTOMY, is an important one in the theory of invariant subspaces. It has recently be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2000
ISSN: 0022-0000
DOI: 10.1006/jcss.1999.1674